Optimal performance of parallel-server systems with job size prediction errors

Modern communication networks integrate distributed computing architectures, in which customers are processed parallel. We show how to minimize the waiting time of customer's jobs by leveraging a simple threshold-based job dispatching policy. The optimal policy leverages SITA routing, assigns servers according size job. Moreover, permits optimize system performance even when is not known priori and estimated means error-prone predictors.